The Inverse Method for the Logic of Bunched Implications
نویسندگان
چکیده
The inverse method, due to Maslov, is a forward theorem provingmethod for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inverse method for propositional BI without units. We adapt the sequent calculus for BI into a forward calculus. The soundness and completeness of the calculus are proved, and a canonical form for bunches is given.
منابع مشابه
The application of a resource logic to the non-temporal analysis of processes acting on resources
business process analysis, bunched implications, concurrency, demos Many systems exist that can be modelled as processes interacting through shared resources -people, factories and computer systems to name but a few. Building upon a logic capable of reasoning about static resource models, the Logic of Bunched Implications, we tentatively define the semantics of a logic capable of reasoning abou...
متن کاملLogic Programming with Bunched Implications (extended Abstract)
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...
متن کاملPetri Net Semantics of Bunched Implications
Engberg and Winskel's Petri net semantics of linear logic is reconsidered , from the point of view of the logic BI of bunched implications. We rst show how BI can be used to overcome a number of diiculties pointed out by Engberg and Winskel, and we argue that it provides a more natural logic for the net semantics. We then brieey consider a more expressive logic based on an extension of BI with ...
متن کاملResource Graphs and Countermodels in Resource Logics
In this abstract we emphasize the role of a semantic structure called resource graph in order to study the provability in some resource-sensitive logics, like the Bunched Implications Logic (BI) or the Non-commutative Logic (NL). Such a semantic structure is appropriate for capturing the particular interactions between different kinds of connectives (additives and multiplicatives in BI, commuta...
متن کاملClassical Logic of Bunched Implications
We consider a classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implications (BI) from a modeland prooftheoretic perspective. We present a class of classical models of BI which extend the usual BI-models, based on partial commutative monoids, with an algebraic notion of “resource negation”. This class of models gives rise to natural definitions of multiplicative fals...
متن کامل